Subgraph statistics in subcritical graph classes
نویسندگان
چکیده
منابع مشابه
Subgraph statistics in subcritical graph classes
Let H be a fixed graph and G a subcritical graph class. In this paper we show that the number of occurrences of H (as a subgraph) in a uniformly at random graph of size n in G follows a normal limiting distribution with linear expectation and variance. The main ingredient in our proof is the analytic framework developed by Drmota, Gittenberger and Morgenbesser to deal with infinite systems of f...
متن کاملAsymptotic Study of Subcritical Graph Classes
We present a unified general method for the asymptotic study of graphs from the so-called “subcritical” graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general method works both in the labelled and unlabelled framework. The main results concern the asymptotic enumeration and the limit laws of properties of random graphs chosen from ...
متن کاملPolytopes from Subgraph Statistics
We study polytopes that are convex hulls of vectors of subgraph densities. Many graph theoretical questions can be expressed in terms of these polytopes, and statisticians use them to understand exponential random graph models. Relations among their Ehrhart polynomials are described, their duals are applied to certify that polynomials are nonnegative, and we find some of their faces. For the ge...
متن کاملSubgraph trees in graph theory
The classical clique tree approach to chordal graphs (and, more recently, to strongly chordal graphs) can be generalized to show a common structure for other classes of graphs, including clique graphs of chordal graphs, outerplanar graphs, distance-hereditary graphs, and chordal bipartite graphs. c © 2003 Elsevier B.V. All rights reserved.
متن کاملOn the Maximum Number of Dominating Classes in Graph Coloring
In this paper we investigate the dominating- -color number، of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and H. This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2017
ISSN: 1042-9832
DOI: 10.1002/rsa.20721